An abstract Lagrangian framework for computing shape derivatives

نویسندگان

چکیده

In this paper we study an abstract framework for computing shape derivatives of functionals subject to PDE constraints in Banach spaces. We revisit the Lagrangian approach using implicit function theorem setting tailored applications optimization. This yields practical formulae compute derivative a functional, material state, and adjoint state. Furthermore, it allows gain insight on duality between state show several method computation distributed problems involving linear elliptic, nonlinear parabolic PDEs distributions. also compare our with other techniques including averaged method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

an investigation about the appropriate stochastic modeling framework for agricultural insurance pricing

با توجه به اینکه بیمه محصولات کشاورزی در ایران بیشتر جنبه ای حمایتی دارد و خسارات گزارش شده عموما بیش از حق بیمه های دریافت شده است، در این پایان نامه به جهت تعیین قیمت بیمه محصولات کشاورزی (گندم دیم) از فرآیندهای نوفه شلیک به عنوان مدلی مناسب استفاده شده است. بر اساس داده های صندوق بیمه کشاورزی از خسارات اعلام شده در سال زراعی 1388-1389 گندم دیم، در این پایان نامه حق بیمه خالص و ناخالص این محص...

An Effective Task Scheduling Framework for Cloud Computing using NSGA-II

Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...

متن کامل

Symbolically Computing Most-Precise Abstract Operations for Shape Analysis

Shape analysis concerns the problem of determining “shape invariants” for programs that perform destructive updating on dynamically allocated storage. This paper presents a new algorithm that takes as input a shape descriptor (describing some set of concrete stores X) and a precondition p, and computes the most-precise shape descriptor for the stores in X that satisfy p. This algorithm solves s...

متن کامل

An Abstract Weighting Framework for Clustering Algorithms

Recent works in unsupervised learning have emphasized the need to understand a new trend in algorithmic design, which is to influence the clustering via weights on the instance points. In this paper, we handle clustering as a constrained minimization of a Bregman divergence. Theoretical results show benefits resembling those of boosting algorithms, and bring new modified weighted versions of cl...

متن کامل

An Abstract Framework for Globalising Interactive Systems

We present an abstract framework for designing and developing globalised interactive systems from simple components viewed as games [1] (K. Stathis, M.J. Sergot, Games as a Metaphor for Interactive Systems, in: M.A. Sasse, R.J. Cunningham, R.L. Winder (Eds.), People and Computers XI (Proceedings of HCI’96), August 1996, London, UK, BCS Conference Series, Springer-Varlag, pp. 19–33). We identify...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations

سال: 2023

ISSN: ['1262-3377', '1292-8119']

DOI: https://doi.org/10.1051/cocv/2022078